A generalized pressing-down lemma and isocompactness
نویسندگان
چکیده
منابع مشابه
The Generalized XOR Lemma
The XOR Lemma states that a mapping is regular or balanced if and only if all the linear combinations of the component functions of the mapping are balanced Boolean functions. The main contribution of this paper is to extend the XOR Lemma to more general cases where a mapping may not be necessarily regular. The extended XOR Lemma has applications in the design of substitution boxes or S-boxes u...
متن کاملGeneralized Neyman - Pearson Lemma
We extend the classical Neyman-Pearson theory for testing composite hypotheses versus composite alternatives, using a convex duality approach as in Witting (1985). Results of Aubin & Ekeland (1984) from non-smooth convex analysis are employed, along with a theorem of Komll os (1967), in order to establish the existence of a max-min optimal test and to investigate its properties. The theory is i...
متن کاملMore on the pressing down game
We investigate the pressing down game and its relation to the Banach Mazur game. In particular we show: Consistently relative to a supercompact, there is a nowhere precipitous normal ideal I on א2 such that player nonempty wins the pressing down game of length א1 on I even if player empty starts. For the proof, we construct a forcing notion to force the following: There is normal, nowhere preci...
متن کاملGeneralized Geometry, Equivariant ∂∂-lemma, and Torus Actions
In this paper we first consider the Hamiltonian action of a compact connected Lie group on anH-twisted generalized complexmanifold M. Given such an action, we define generalized equivariant cohomology and generalized equivariant Dolbeault cohomology. If the generalized complex manifoldM satisfies the ∂∂-lemma, we prove that they are both canonically isomorphic to (Sg)⊗HH(M), where (Sg ) is the ...
متن کاملGeneralized separation theorems and the Farkas' lemma
The main purpose of this paper is to extend the conventional separation theorems concerning the convex subset of Rm to generalized separation theorems concerning the convex subset of Rm × Sn. This is accomplished by the introduction of the generalized inner product in Rm × Sn. Then we derive the famous Farkas' lemma in nonlinear semidefinite programming, which may be very important for the anal...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the American Mathematical Society
سال: 1981
ISSN: 0002-9939
DOI: 10.1090/s0002-9939-1981-0593480-0